A Fundamental Storage-Communication Tradeoff for Distributed Computing With Straggling Nodes
نویسندگان
چکیده
منابع مشابه
Storage and Repair Bandwidth Tradeoff for Distributed Storage Systems with Clusters and Separate Nodes
The optimal tradeoff between node storage and repair bandwidth is an important issue for distributed storage systems (DSSs). As for realistic DSSs with clusters, when repairing a failed node, it is more efficient to download more data from intra-cluster nodes than from cross-cluster nodes. Therefore, it is meaningful to differentiate the repair bandwidth from intra-cluster and cross-cluster. Fo...
متن کاملCost-Bandwidth Tradeoff In Distributed Storage Systems
Distributed storage systems are mainly justified due to the limited amount of storage capacity and improving the reliability through distributing data over multiple storage nodes. On the other hand, it may happen the data is stored in unreliable nodes, while it is desired the end user to have a reliable access to the stored data. So, in an event that a node is damaged, to prevent the system rel...
متن کاملCoding, Computing, and Communication in Distributed Storage Systems
Conventional studies in communication networks mostly focus on securely and reliably transmitting data from a source node (or multiple source nodes) to multiple destinations. A more general problem appears when the destination nodes are interested in obtaining functions of the data available in distributed source nodes. For obtaining a function, transmitting all the data to a destination node a...
متن کاملThe Security - Communication tradeoff in Mobile Computing
Mobile computing introduces a paradigm that enables new services to be deployed efficiently over the network. However, these new promising capabilities come with inherent security hazards, both for the machines that host the mobile code, and to the mobile code itself. In this paper we present a framework for the rigorous study of the latter problem, i.e., the ability of the mobile applet to car...
متن کاملBlock-Diagonal and LT Codes for Distributed Computing With Straggling Servers
We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors. The first scheme is based on partitioning the matrix into submatrices and applying maximum distance separable (MDS) codes to each submatrix. For this scheme, we prove that up to a given number of partitions the communication load and the computational delay (not including the encoding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2020
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2020.3020549